The Geometry of M D Queues and Large Deviation

نویسنده

  • Kenji NAKAGAWA
چکیده

Since an M D queue is represented by a Markov chain we can consider the set of all the M D queues as a subset of Markov chains A geometric structures is induced from the geometric structure of the set of Markov chains which forms an exponential family In this paper we show that in the large deviation of the tail probability of the queue length of an M D the rate function and a twisted Markov chain etc are represented in terms of the geometry Moreover in the importance sampling IS simulation for the M D queue we elucidate the geometric relation between the underlying distribution and a simulation distribution and evaluate the variance of an IS estimate by geometric quantities Kew words M D queue large deviation importance sampling information geom etry

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

Instrument dependency of Kubelka-Munk theory in computer color matching

Different industries are usually faced with computer color matching as an important problem. The most famous formula which is commonly used for recipe prediction is based on Kubelka-Munk K-M theory. Considering that spectrophotometer’s geometry and its situation influence the measured spectral values, the performance of this method can be affected by the instrument. In the present study, three ...

متن کامل

Turbulent Flow in 2-D Domains with Complex Geometry-Finite Elelment Method

Using the highly recommended numerical techniques, a finite element computer code is developed to analyse the steady incompressible, laminar and turbulent flows in 2-D domains with complex geometry. The Petrov-Galerkin finite element formulation is adopted to avoid numerical oscillations. Turbulence is modeled using the two equation k-ω model. The discretized equations are written in the form o...

متن کامل

Turbulent Flow in 2-D Domains with Complex Geometry-Finite Elelment Method

Using the highly recommended numerical techniques, a finite element computer code is developed to analyse the steady incompressible, laminar and turbulent flows in 2-D domains with complex geometry. The Petrov-Galerkin finite element formulation is adopted to avoid numerical oscillations. Turbulence is modeled using the two equation k-ω model. The discretized equations are written in the form o...

متن کامل

A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005